A Framework for Identification and Validation of Affine Hybrid Automata from Input-Output Traces

Learning Moore Machines from Input-Output Traces

The problem of learning automata from example traces (but no equivalence or membership queries) is fundamental in automata learning theory and practice. In this paper we study this problem for finite state machines with inputs and outputs, and in particular for Moore machines. We introduce three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of inputoutput t...

Interface Input/Output Automata

Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch’s I/O automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions from guarantees not yet seen in other behavioral interface theories. Moreover we derive t...

Dynami Input / Output Automata :

Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic,

The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using level...

Control design for nondeterministic input/output automata

This paper presents a control design approach for Input/Output (I/O) automata. The main contribution consists of an explicit description of the control design procedure, which leads to an implementation-friendly architecture. Moreover, the concepts of well-posedness of the control loop and controllability are investigated. The level control of a chemical process is used as a case study for demo...